Maximizing Barrier Coverage Lifetime with Mobile Sensors

نویسندگان

  • Amotz Bar-Noy
  • Dror Rawitz
  • Peter Terlecky
چکیده

Sensor networks are ubiquitously used for detection and tracking and as a result covering is one of the main tasks of such networks. We study the problem of maximizing the coverage lifetime of a barrier by mobile sensors with limited battery powers, where the coverage lifetime is the time until there is a breakdown in coverage due to the death of a sensor. Sensors are first deployed and then coverage commences. Energy is consumed in proportion to the distance traveled for mobility, while for coverage, energy is consumed in direct proportion to the radius of the sensor raised to a constant exponent. We study two variants which are distinguished by whether the sensing radii are given as part of the input or can be optimized, the fixed radii problem and the variable radii problem. We design parametric search algorithms for both problems for the case where the final order of the sensors is predetermined and for the case where sensors are initially located at barrier endpoints. In contrast, we show that the variable radii problem is strongly NP-hard and provide hardness of approximation results for fixed radii for the case where all the sensors are initially co-located at an internal point of the barrier.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Energy-Efficient Target Coverage in Visual Sensor Networks

Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) ...

متن کامل

Maximizing the lifetime of reinforced barriers in wireless sensor networks

Recently, barrier-coverage in wireless sensor networks is a critical issue because it can be used for various applications (e.g., intrusion detection and border protection). Many existing works for barrier-coverage assume that an intruder penetrates through two opposite sides such as from top to bottom or from bottom to top and focus on constructing barriers to detect those penetrations. Howeve...

متن کامل

An Integrated Self-deployment and Coverage Maintenance Scheme for Mobile Sensor Networks

In mobile sensor networks, the coverage improvement problem, i.e., maximizing and/or maintaining overall sensing coverage, is a fundamental research issue attracting many researchers. Existing coverage improvement algorithms such as sensor self-deployment algorithms and sensor relocation protocols enhance coverage with limitations due to their specialized design purposes. In this paper, we prop...

متن کامل

Energy-Efficient Coverage Quality Guaranteed in Wireless Sensors Network

Wireless sensor network is always deployed randomly in specific area for intrusion detection and environmental monitoring. Due to the hostile environment, the sensor nodes could not be replaced easily. The efficient energy consumption scheme is known to be more and more important. Meanwhile, saving the energy could not impact the coverage quality. Connecting proper sensors adaptively as a barri...

متن کامل

Greedy Algorithms for Target Coverage Lifetime Management Problem in Wireless Sensor Networks

When several low power sensors are randomly deployed in a field for monitoring targets located at fixed positions, managing the network lifetime is useful as long as replacing battery of dead sensors is not often feasible. The most commonly investigated mechanism for coverage preserving while maximizing the network lifetime is to design efficient sleep scheduling protocols, so that sensors can ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2013